A simple approximation algorithm for WIS based on the approximability in k
نویسنده
چکیده
In this note, we show how optimal or approximate weighted independent sets in k-partite graphs may yield to a good approximate weighted independent set in general graphs. Precisely, optimal solutions in bipartite graphs do yield to a 2 ∆(G) approximation and, more generally, ρ-approximate solutions in k-partite graphs yield to a k ∆(G)ρ-approximation in general graphs.
منابع مشابه
A simple approximation algorithm for WIS based on the approximability in k-partite graphs
In this note, we show how optimal or approximate weighted independent sets in k-partite graphs may yield to a good approximate weighted independent set in general graphs. Precisely, optimal solutions in bipartite graphs do yield to a 2 ∆(G) approximation and, more generally, ρ-approximate solutions in k-partite graphs yield to a k ∆(G)ρ-approximation in general graphs.
متن کاملProving Weak Approximability Without Algorithms
A predicate f : {−1, 1} 7→ {0, 1} with ρ(f) = Ex∈{−1,1}k [f(x)] is said to be strongly approximation resistant if, for every ε > 0, given a near-satisfiable instance of MAX k-CSP(f), it is hard to find an assignment such that the fraction of constraints satisfied is outside the range [ρ(f)−ε, ρ(f) +ε]. A predicate which is not strongly approximation resistant is known as weakly approximable. We...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملA note on the hardness of approximating the k-way Hypergraph Cut problem
We consider the approximability of k-way Hypergraph Cut problem: the input is an edge-weighted hypergraph G = (V, E) and an integer k and the goal is to remove a min-weight subset of the edges such that the residual graph has at least k connected components. When G is a graph this problem admits a 2(1 − 1/k)-approximation [8], however, there has been no non-trivial approximation ratio for gener...
متن کاملMilder Definitions of Computational Approximability: The Case of Zero-Knowledge Protocols
Many cryptographic primitives—such as pseudorandom generators, encryption schemes, and zero-knowledge proofs—center around the notion of approximability. For instance, a pseudorandom generator is an expanding function which on a random seed, approximates the uniform distribution. In this paper, we classify different notions of computational approximability in the literature, and provide several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 171 شماره
صفحات -
تاریخ انتشار 2006